Computing Weight Distributions of Binary Linear Block Codes on a CCM
نویسنده
چکیده
This paper presents an implementation for computing weight distributions of binary linear block codes on an FPGA-based Custom Computing Machine (CCM). It consists of a heavily pipelined circuit customized for every code investigated. A hardware solution is very attractive for this time-consuming problem: It is about seven times faster than the best software solution we know and computes a new weight every 150 ns. For larger codes the saved time is in the range of days. The key concepts and some peculiarities of this implementation are presented along with performance data. Additionally, we discuss chances of and obstacles to automatically deriving this solution from a high-level program (rather than from an HDL description).
منابع مشابه
A Method to determine Partial Weight Enumerator for Linear Block Codes
In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the error probability for the soft decision maximum likelihood decoder (MLD). As application of this method we give partial weight enumerators and analytical perfo...
متن کاملOptimal three-weight cubic codes
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring R = F2+ vF2+ v 2 F2, where v 3 = 1. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distributions are computed by employing character sums. The three-weight binary linear codes which we construct are shown to be optimal when m i...
متن کاملSupport Weight Enumerators and Coset Weight Distributions of Isodual Codes
In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between support weight enumerators and coset weight distributions of a code that can be used to compute partial information about one set of these code invariants from the other. The support weight enumerators and complete co...
متن کاملThe weight distributions of some cyclic codes with three or four nonzeros over 𝔽3
Because of efficient encoding and decoding algorithms, cyclic codes are an important family of linear block codes, and have applications in communication and storage systems. However, their weight distributions are known only for a few cases mainly on the codes with one or two nonzeros. In this paper, the weight distributions of two classes of cyclic codes with three or four nonzeros are determ...
متن کاملOn Linear Codes over Z2s
In an earlier paper the authors studied simplex codes of type α and β over Z4 and obtained some known binary linear and nonlinear codes as Gray images of these codes. In this correspondence, we study weight distributions of simplex codes of type α and β over Z2s . The generalized Gray map is then used to construct binary codes. The linear codes meet the Griesmer bound and a few non-linear codes...
متن کامل